New Upper Bounds on Generalized Weights
نویسنده
چکیده
weight distribution of linear codes over GF (q l) having generator matrices over GF (q)," \New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans.
منابع مشابه
New Upper Bounds on Generalized Weights
We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملGeneralizations of Sherman’s Theorem by Taylor’s Formula
Extensions of Sherman’s theorem to convex functions of higher order and to real weights are obtained by using Taylor’s formula. New upper bounds for Sherman’s difference and generalized inequalities are established. Some related Cauchy-type means are discussed.
متن کاملModified Goal Programming Approach for Improving the Discrimination Power and Weights Dispersion
Data envelopment analysis (DEA) is a technique based on linear programming (LP) to measure the relative efficiency of homogeneous units by considering inputs and outputs. The lack of discrimination among efficient decision making units (DMUs) and unrealistic input-outputs weights have been known as the drawback of DEA. In this paper the new scheme based on a goal programming data envelopment an...
متن کاملOn the generalized Hamming weights of convolutional codes
Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...
متن کامل